منابع مشابه
Shape Partitioning by Convexity
The partitioning of 2D shapes into subparts is an important component of shape analysis. This paper de nes a formulation of convexity as a criterion of good part decomposition. It's appropriateness is validated by applying it to some simple shapes as well as against showing its close correspondence with Ho man and Singh's part saliency factors.
متن کاملConvexity Shape Prior for Segmentation
Convexity is known as an important cue in human vision. We propose shape convexity as a new high-order regularization constraint for binary image segmentation. In the context of discrete optimization, object convexity is represented as a sum of 3-clique potentials penalizing any 1-0-1 configuration on all straight lines. We show that these non-submodular interactions can be efficiently optimize...
متن کاملUses of Convexity in Numerical Domain Partitioning
We study the diierent manifestations of convexity in classiier-constructing machine learning algorithms. Two principal ways to apply the consequences of the convexity of the evaluation function to enhance numerical domain partitioning exist: it enables static and dynamic pruning of partition candidates. Numerical attribute handling is a potential time-consumption bottleneck in classiier learnin...
متن کاملOn difference sequence spaces defined by Orlicz functions without convexity
In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.
متن کاملMultilevel Mesh Partitioning for Optimizing Domain Shape
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut-edge weight in the graph with the aim of minimising the par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
سال: 2000
ISSN: 1083-4427
DOI: 10.1109/3468.833102